package company;

//字符串hash初步

public class sanlie {

   static int maxn=11;
    static int n;
    static int []p=new int[maxn];
  static  boolean []hash=new boolean[maxn];



    /**
    public static  void main (String [] args)
    {
        Scanner stdin=new Scanner(System.in);

       char[] s=new char[5];
        int len = 5;
           s=stdin.next().toCharArray();
        System.out.println(hashFunc( s, len));
    }
    public static int hashFunc(char[] s, int len)
    {int id=0;
        for(int i=0;i<len;i++)
        {
            id=id*26+(s[i]-'A');
        }
return id;
    }*/
/**
    public static void main(String [] args)
    {
          n=3;
        generate(1);

    }

    public static void generate(int index)
    {
        if(index==n+1)
        {
            for(int i=1;i<=n;i++)
            {
                System.out.print(p[i]);
            }
            System.out.println();
            return;
        }
        for(int x=1;x<=n;x++)
        {
            if(hash[x]==false)
            {
                p[index]=x;
                hash[x]=true;
                generate(index+1);
                hash[x]=false;
            }
        }

    }*/
}
